Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph
نویسندگان
چکیده
We present a new self-stabilizing algorithm for finding a maximal strong matching in an arbitrary distributed network. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2]. The concepts behind the algorithm, using Ids in the newtork, promise to have applications for other graph theoretic primitives.
منابع مشابه
A Self-Stabilizing Algorithm for Maximum Matching in Trees
Constructing a maximum matching is an important problem in graph theory with applications to problems such as job assignment and task scheduling. Many eecient sequential and parallel algorithms exist for solving the problem. However, no distributed algorithms are known. In this paper, we present a distributed, self-stabilizing algorithm for nding a maximum matching in trees. Since our algorithm...
متن کاملSelf-stabilizing Neighborhood Unique Naming under Unfair Scheduler
We propose a self-stabilizing probabilistic solution for the neighborhood unique naming problem in uniform, anonymous networks with arbitrary topology. This problem is important in the graph theory Our solution stabilizes under the unfair distributed scheduler. We prove that this solution needs in average only one trial per processor. We use our algorithm to transform the [6] maximal matching a...
متن کاملA self-stabilizing algorithm for maximal matching in link-register model in $O(n\Delta^3)$ moves
In the matching problem, each node maintains a pointer to one of its neighbor or to null, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to null, in which case no neighbor can also point to null. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the link-registe...
متن کاملSelf-Stabilizing Graph Protocols
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.
متن کاملA self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves
In the matching problem, each node maintains a pointer to one of its neighbor or to null, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to null, in which case no neighbor can also point to null. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the link-registe...
متن کامل